快速，可靠地找到准确的逆运动学（IK）解决方案仍然是机器人操纵的挑战性问题。现有的数值求解器广泛适用，但依赖于本地搜索技术来管理高度非关键目标函数。最近，基于学习的方法已显示出有望作为生成快速准确的IK结果的一种手段。可以轻松地将学习的求解器与端到端系统中的其他学习算法集成在一起。但是，基于学习的方法具有致命的脚跟：每个感兴趣的机器人都需要一个专门的模型，必须从头开始训练。为了解决这一关键缺点，我们研究了一种新颖的距离几何机器人表示，并与图形结构相结合，使我们能够利用图形神经网络（GNNS）的灵活性。我们使用这种方法来训练第一个学到的生成图形逆运动学（GGIK）求解器，它至关重要的是，“机器人 - 敏捷” - 单个模型能够为各种不同的机器人提供IK解决方案。此外，GGIK的生成性质使求解器可以同时生产大量不同的解决方案，并与最小的额外计算时间同行，使其适用于诸如基于采样的运动计划之类的应用。最后，GGIK可以通过提供可靠的初始化来补充本地IK求解器。这些优势以及使用与任务相关的先验并通过新数据不断改进的能力表明，GGIK有可能成为灵活的，基于学习的机器人操作系统的关键组成部分。

反向运动学（IK）是找到满足一个或多个末端效应器的位置或姿势的限制的机器人联合配置的问题。对于具有冗余自由度的机器人，通常存在无限，不透露的解决方案。当通过工作空间中的障碍施加碰撞限制时，IK问题进一步复杂。通常，不存在产生可行配置的闭合表达，促使使用数值解决方案方法。然而，这些方法依赖于局部优化非凸起问题，通常需要准确的初始化或许多重新初始化来收敛到有效的解决方案。在这项工作中，我们首先将复杂的工作空间约束制定逆运动学，作为凸的可行性问题，其低级可行点提供精确的IK解决方案。然后，我们呈现\ texttt {cidgik}（距离 - 几何反向运动学的凸迭代），这是一种解决这种可行性问题的算法，其具有旨在鼓励低秩最小化的半导体级程序的序列。我们的问题制定优雅地统一机器人的配置空间和工作空间约束：内在机器人几何形状和避免避免都表示为简单的线性矩阵方程和不等式。我们对各种流行的操纵器模型的实验结果比传统的非线性优化的方法更快，更准确的会聚，特别是在具有许多障碍的环境中。

解决逆运动学问题是针对清晰机器人的运动计划，控制和校准的基本挑战。这些机器人的运动学模型通常通过关节角度进行参数化，从而在机器人构型和最终效果姿势之间产生复杂的映射。或者，可以使用机器人附加点之间的不变距离来表示运动学模型和任务约束。在本文中，我们将基于距离的逆运动学的等效性和大量铰接式机器人和任务约束的距离几何问题进行形式化。与以前的方法不同，我们使用距离几何形状和低级别矩阵完成之间的连接来通过局部优化完成部分欧几里得距离矩阵来找到逆运动学解决方案。此外，我们用固定级革兰氏矩阵的Riemannian歧管来参数欧几里得距离矩阵的空间，从而使我们能够利用各种成熟的Riemannian优化方法。最后，我们表明，绑定的平滑性可用于生成知情的初始化，而无需大量的计算开销，从而改善收敛性。我们证明，我们的逆运动求解器比传统技术获得更高的成功率，并且在涉及许多工作区约束的问题上大大优于它们。

诸如操纵器之类的铰接机器人必须在不确定和动态的环境中运行，例如，相互作用（例如与人类同事）是必要的。在这种情况下，必须快速适应操作空间限制的意外变化的能力至关重要。在操纵器的配置空间中的某些点（称为奇异点），机器人失去了一个或多个自由度（DOF），并且无法在特定的操作空间方向上移动。无法在操作空间中朝任意方向移动会损害适应性和安全性。我们引入了一个几何感知奇异性索引，该索引在对称正定定义矩阵上使用Riemannian度量定义，以提供与奇异构型的接近度的度量。我们证明我们的索引避免了其他共同指数固有的某些故障模式和困难。此外，我们表明该索引可以轻松区分，使其与用于操作空间控制的局部优化方法兼容。我们的实验结果表明，对于遵循任务的到达和路径，基于我们的索引优化优于一种常见的可操作性最大化技术，并确保奇异性运动动作。

大多数逆运动学（IK）算法在由关节角定义的配置空间中搜索解决方案。然而，许多机器人的运动学也可以用刚性附着点之间的距离来描述，这些点齐构成了欧几里得距离矩阵。运动学的这种替代几何描述揭示了IK与低级矩阵完成问题之间的优雅等效性。我们使用这种连接来针对具有对称关节角度约束的各种铰接式机器人对IK实施新的基于Riemannian优化的解决方案。

在许多领域，包括强化学习和控制在内的许多领域，从一系列高维观测中学习或识别动力学是一个困难的挑战。最近通过潜在动力学从生成的角度研究了这个问题：将高维观测结果嵌入到较低维的空间中，可以在其中学习动力学。尽管取得了一些成功，但尚未将潜在动力学模型应用于现实世界的机器人系统，在这些机器人系统中，学习的表示形式必须适合各种感知混杂和噪声源。在本文中，我们提出了一种共同学习潜在状态表示的方法以及在感知困难条件下的长期计划和闭环控制的相关动力。作为我们的主要贡献，我们描述了我们的表示如何能够通过检测新颖或分布（OOD）输入来捕获测试时间的异质或输入特异性不确定性的概念。我们介绍了有关两个基于图像的任务的预测和控制实验的结果：一个模拟的摆平衡任务和实现任务的现实世界机器人操纵器。我们证明，与仅在不同程度的输入降解的情况下，我们的模型可产生更准确的预测，并表现出改善的控制性能。

Efficient and robust control using spiking neural networks (SNNs) is still an open problem. Whilst behaviour of biological agents is produced through sparse and irregular spiking patterns, which provide both robust and efficient control, the activity patterns in most artificial spiking neural networks used for control are dense and regular -- resulting in potentially less efficient codes. Additionally, for most existing control solutions network training or optimization is necessary, even for fully identified systems, complicating their implementation in on-chip low-power solutions. The neuroscience theory of Spike Coding Networks (SCNs) offers a fully analytical solution for implementing dynamical systems in recurrent spiking neural networks -- while maintaining irregular, sparse, and robust spiking activity -- but it's not clear how to directly apply it to control problems. Here, we extend SCN theory by incorporating closed-form optimal estimation and control. The resulting networks work as a spiking equivalent of a linear-quadratic-Gaussian controller. We demonstrate robust spiking control of simulated spring-mass-damper and cart-pole systems, in the face of several perturbations, including input- and system-noise, system disturbances, and neural silencing. As our approach does not need learning or optimization, it offers opportunities for deploying fast and efficient task-specific on-chip spiking controllers with biologically realistic activity.

Recent advances in language modeling have enabled new conversational systems. In particular, it is often desirable for people to make choices among specified options when using such systems. We address the problem of reference resolution, when people use natural expressions to choose between real world entities. For example, given the choice `Should we make a Simnel cake or a Pandan cake?' a natural response from a non-expert may be indirect: `let's make the green one'. Reference resolution has been little studied with natural expressions, thus robustly understanding such language has large potential for improving naturalness in dialog, recommendation, and search systems. We create AltEntities (Alternative Entities), a new public dataset of entity pairs and utterances, and develop models for the disambiguation problem. Consisting of 42K indirect referring expressions across three domains, it enables for the first time the study of how large language models can be adapted to this task. We find they achieve 82%-87% accuracy in realistic settings, which while reasonable also invites further advances.

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

We present the Verifee Dataset: a novel dataset of news articles with fine-grained trustworthiness annotations. We develop a detailed methodology that assesses the texts based on their parameters encompassing editorial transparency, journalist conventions, and objective reporting while penalizing manipulative techniques. We bring aboard a diverse set of researchers from social, media, and computer sciences to overcome barriers and limited framing of this interdisciplinary problem. We collect over $10,000$ unique articles from almost $60$ Czech online news sources. These are categorized into one of the $4$ classes across the credibility spectrum we propose, raging from entirely trustworthy articles all the way to the manipulative ones. We produce detailed statistics and study trends emerging throughout the set. Lastly, we fine-tune multiple popular sequence-to-sequence language models using our dataset on the trustworthiness classification task and report the best testing F-1 score of $0.52$. We open-source the dataset, annotation methodology, and annotators' instructions in full length at https://verifee.ai/research to enable easy build-up work. We believe similar methods can help prevent disinformation and educate in the realm of media literacy.